Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
نویسندگان
چکیده
منابع مشابه
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
Connectedness of efficient solutions is a powerful property in multiple objective combinatorial optimization since it allows the construction of the complete efficient set using neighborhood search techniques. In this paper we show that, however, most of the classical multiple objective combinatorial optimization problems do not possess the connectedness property in general, including, among ot...
متن کاملExact generation of epsilon-efficient solutions in multiple objective programming
It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: since this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might in general be only approximate to some efficient point. From among th...
متن کاملComputing efficient solutions to fuzzy multiple objective linear programming problems
In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...
متن کاملMulti-Objective Combinatorial Optimization: Problematic and Context
1 CINVESTAV-IPN, Departamento de Computación, Av. IPN No. 2508, Col. San Pedro Zacatenco, México, D.F. 07300, Mexico [email protected] 2 Laboratoire d’Informatique Fondamentale de Lille (LIFL), UMR CNRS 8022, Université Lille 1, Bâtiment M3, 59655 Villeneuve d’Ascq cedex, France 3 INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue Halley, 59650 Villeneuve d’Ascq, Fran...
متن کاملCompromise Solutions in Multicriteria Combinatorial Optimization
In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2011
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-011-9849-8